A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"

نویسندگان

  • Adrien Brun
  • Chunhui Guo
  • Shangping Ren
چکیده

In [1], the author empirically compared EDF (Earliest Deadline First) and RM (Rate Monotonic) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1,000 time units of scheduling activities. However, based on test settings given in [1], the first 1,000 time units occupies only a small percentage of the entire task set’s hyper-period. We extend EDF preemption behavior study by extending scheduling activities from the first small percentage of a hyper-period of a given task to the entire hyper-period. The extended experiments indicate that the number of preemptions occurred at the beginning of a task set’s hyper-period does not necessarily represent the trend for the entire hyper-period. Hence, comparisons and conclusions made based on a small percentage of a scheduling interval over a task set’s hyper-period may not be accurate. Second, the total number of preemptions within a task set’s hyper-period does not decrease when the task set total utilization increases which is different from the observation obtained in [1]. We also investigate the impact of execution time differences among tasks on the preemption behavior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interrupted EDF Scheduling

In this paper we extend the results for the mixed scheduling algorithm of Liu and Layland in [3]. It is the seminal paper for the basic real-time scheduling algorithms: Rate Monotonic Scheduling (RMS) and Earliest Deadline First (EDF) Scheduling, and for their corresponding schedulability tests [1,2,4,5,7]. In a final section of the paper the authors also investigate the mixed scheduling algori...

متن کامل

CSC 714: Final Project Report

A task scheduling simulator for timing analysis of the various task sets with different scheduling policies was implemented and tested. The simulator supports the various scheduling policies like Rate Monotonic, deadline monotonic and EDF, widely used for scheduling real time applications. It simulates the task execution for the time period, and then it outputs the time based representation of ...

متن کامل

REAL - TIME EMBEDDED SYSTElkS \ \ message scheduling controller area network

The Controller Area Network has a maximum transmission rate of 1 Mbitk and its fixed priorities-based medium access control limits the maximum bus utilisation when timeliness guarantees are required. An implementation of earliest deadline first (EDF) message scheduling on CAN, based on the F’IT CAN protocol, is presented, which allows higher utilisation factors with timeliness guarantees. The a...

متن کامل

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

Bounding Preemptions under EDF and RM Schedulers Technical Report: MS-CIS-06-07

Assurance of timing requirements from a real-time system schedule can be obtained using schedulability analysis. Existing analysis techniques ignore the preemption overhead incurred by the system, when the tasks are scheduled using preemptive schedulers. Preemptive schedulers can preempt the execution of a real-time task when a higher priority task is released by the system. Every job preemptio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Embedded Systems Letters

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2015